#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<cstring>
#include<unordered_map>
#include<unordered_set>
#define int long long 
#define x first 
#define y second 
using namespace std;
const int N = 1e5 + 10;
set<int> st;
int a[N];
void solve()
{
     int n,t;
     cin >> n >> t;
     for(int i = 1; i <= n; i++) cin >> a[i];
     int m = pow(10,t);
     for(int i = 1; i <= n; i++) st.insert(a[i] % m);
     cout << st.size() << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int t = 1;
    while(t--) solve();
    return 0;
}